295B - Greg and Graph - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main(){
    ll n, v;
    cin >> n;
    vector<vector<ll>> mat(n, vector<ll>(n));
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            cin >> mat[i][j];
    vector<ll> order(n), result(n);
    vector<bool> visited(n);
    for(int i=0;i<n;i++) {
        cin >> order[i];
        order[i]--;
    }
    for(int i=n-1;i>=0;i--) {
        ll sum = 0;
        int k = order[i];
        visited[k] = 1;
        for(int i=0;i<n;i++) {
            for(int j=0;j<n;j++) {
                mat[i][j] = min(mat[i][j], mat[i][k] + mat[k][j]);
                if(visited[i] && visited[j]) sum += mat[i][j];
            }
        }
        result[i] = sum;
    }
    for(int i=0;i<n;i++) {
        if(i!=0) cout << " ";
        cout << result[i];
    }
}